Dactl Rewriting Is Categorical

نویسنده

  • R. Banach
چکیده

The graph-manipulating core of the general term graph rewriting language DACTL, namely contraction building and redirection, is reexamined from a categorical viewpoint. The essentials of this rather complex two-phase operational semantics is recast as a Grothendieck opfibration of a category of graph rewrites over a base of rewrite rules. This generalises previous attempts to categorise contractum building and redirection as pushouts and is able to describe more DACTL rewrites than pushout models. The full operational core model conforms to a more restricted version of this construction and is able to successfully cope with examples such as the infamous circular I example a : I[ a ].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dactl: An Experimental Graph Rewriting Language

A generalized computational model based on graph rewriting is presented along with Dactl, an associated compiler target (intermediate) language. An illustration of the capability of graph rewriting to model a variety of computational formalisms is presented by showing how some examples written originally in a number of languages can be described as graph rewriting transformations using Dactl no...

متن کامل

MONSTR II - Suspending Semantics and Independence

The suspending semantic model for the execution of the MONSTR generalised term graph rewriting language is defined. This is the canonical operational semantic model for the MONSTR language. Its correctness with respect to DACTL semantics is discussed, and a number of general theorems on the soundness of suspending executions with respect to DACTL semantics are proved. General theorems are prove...

متن کامل

Implementing Term Rewrite Languages in Dactl

Dactl is a low-level language of graph rewriting, intended for programming highly Garallel machines. The language includes, but is not restricted to, the limited form of graph rewriting which is commonly used to implement functional language such as Miranda, ML, Hope and Clean. In contrast to these functional languages, where the order in which subterms are evahtated (the ma!uation strategy) is...

متن کامل

MONSTR I - Fundamental Issues and the Design of MONSTR

This is the first in a series of papers dealing with the implementation of an extended term graph rewriting model of computation (described by the DACTL language) on a distributed store architecture. In this paper we set out the high level model, and under some simple restrictions, prove an abstract packet store implementation correct modulo garbage. The abstract packet store model is compared ...

متن کامل

Implementing concurrent logic and functional languages in Dactl

A methodology is developed for mapping a wide class of concurrent logic languages (CLLs) onto Dactl, a compiler target language based on generalised graph rewriting. We show how features particular to the generalised graph rewriting model (such as non root overwrites and sharing) can be used to implement CLLs. We identify problems in the mapping of a concurrent logic program to an equivalent se...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1991